Wiresizing with Bu er Placement and Sizing for Power-Delay Tradeo s

نویسندگان

  • Jatan C. Shah
  • Sachin S. Sapatnekar
چکیده

With the increasing in uence of the resistive e ects of interconnects on the performance of VLSI systems, a greater stress is being laid on careful interconnect design. One prominent technique is the approach of sizing wires for long interconnects to achieve the desired speed and power characteristics [1{4]. It has also been suggested that one may appropriately insert repeaters [5] for signi cant delay reductions. This paper uni es these approaches to optimizing an interconnect by placing a prespeci ed number of bu ers (drivers and repeaters) using a dynamic programming procedure and then performing simultaneous wire and bu er sizing using a sensitivity-based heuristic. Experimental results are presented to prove the utility and performance of the approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combined Transistor Sizing with Bu er Insertion for Timing Optimization

This paper presents strategies to insert bu ers in a circuit, combined with gate sizing, to achieve better power-delay and area-delay tradeo s. The delay model incorporates placement-based information and the e ect of input slew rates on gate delays. The results obtained by using the new method are signi cantly better than the results given by merely using a TILOS-like transistor sizing algorit...

متن کامل

Interleaving Bu er Insertion and Transistor Sizing into a Single Optimization

Bu er insertion is a technique that is used either to increase the driving power of a path in a circuit, or to isolate large capacitive loads that lie on noncritical or less critical paths. Gate sizing sets the sizes of gates within a circuit to achieve a given timing speci cation. Traditional design techniques perform gate sizing and bu er insertion as two separate and independent steps during...

متن کامل

Maze Routing with Bu er Insertion and Wiresizing

We propose an elegant formulation of the Maze Routing with Bu er Insertion and Wiresizing pr oblem as a graph-the oretic shortest path problem. This formulation provides time and space performance improvements over previously proposed dynamic-programming based techniques. R outing c onstr aints such as wiring obstacles and restrictions on bu er locations and types are easily incorporated in the...

متن کامل

Algorithms for non-Hanan-based optimization for VLSI interconnectunder a higher-order AWE model

To improve the performance of critical nets where both timing and wire resources are stringent, we integrate bu er insertion and driver sizing separately with non-Hanan optimization and propose two algorithms: BINO (simultaneous Bu er Insertion and Non-Hanan Optimization) and FAR-DS (Full-plane AWE Routing with Driver Sizing). For BINO, we consider the realistic situation that bu er locations a...

متن کامل

A Polynomial Time Optimal Algorithm for Simultaneous Bu er and Wire Sizing

An interconnect joining a source and a sink is divided into xed length uniform width wire segments and some adjacent segments have bu ers in between The problem we considered is to simultaneously size the bu ers and the segments so that the Elmore delay from the source to the sink is minimized Previously no polynomial time al gorithm for the problem has been reported in literature In this paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996